The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
نویسندگان
چکیده
The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithmand the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of the key equation and a newway to use the Euclidean algorithm to solve it are presented, which yield the Berlekamp-Massey algorithm. This results in a new, simpler, and compacter presentation of the Berlekamp-Massey algorithm.
منابع مشابه
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm
The twoprimary decoding algorithms forReed-Solomon codes are the Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.
متن کاملThe Berlekamp-Massey Algorithm. A Sight from Theory of Pade Approximants and Orthogonal Polynomials
In this paper we interpret the Berlekamp-Massey algorithm (BMA) for synthesis of linear feedback shift register (LFSR) as an algorithm computing Pade approximants for Laurent series over arbitrary field. This interpretation of the BMA is based on a iterated procedure for computing of the sequence of polynomials orthogonal to some sequence of polynomial spaces with scalar product depending on th...
متن کاملHigh-speed architectures for Reed-Solomon decoders
New high-speed VLSI architectures for decoding Reed–Solomon codes with the Berlekamp–Massey algorithm are presented in this paper. The speed bottleneck in the Berlekamp–Massey algorithm is in the iterative computation of discrepancies followed by the updating of the error-locator polynomial. This bottleneck is eliminated via a series of algorithmic transformations that result in a fully systoli...
متن کاملDecoding Binary Quadratic Residue codes Using the Euclidean Algorithm
A simplified algorithm for decoding binary quadratic residue (QR) codes is developed in this paper. The key idea is to use the efficient Euclidean algorithm to determine the greatest common divisor of two specific polynomials which can be shown to be the error-locator polynomial. This proposed technique differs from the previous schemes developed for QR codes. It is especially simple due to the...
متن کاملA new decoding algorithm for correcting both erasures and errors of Reed-Solomon codes
In this paper, a high efficient decoding algorithm is developed here in order to correct both erasures and errors for Reed–Solomon (RS) codes based on the Euclidean algorithm together with the Berlekamp–Massey (BM) algorithm. The new decoding algorithm computes the errata locator polynomial and the errata evaluator polynomial simultaneously without performing polynomial divisions, and there is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.2198 شماره
صفحات -
تاریخ انتشار 2009